Proof by bootstrapping
نویسنده
چکیده
The Oxford English Dictionary defines “to bootstrap” as the following: To make use of existing resources or capabilities to raise (oneself) to a new situation or state; to modify or improve by making use of what is already present. The Picard theorem [17, p. 14, Theorem 1.17]: Theorem 1. Let M be a finite dimensional Hilbert space. Let F : M → M be locally Lipschitz. Let t0 ∈ R and let u0 ∈M . Then there exist −∞ ≤ T− < t0 < T+ ≤ +∞ such that, for I = (T−, T+), there exists a unique u : I →M satisfying u(t0) = u0 and ∂tu(t) = F (u(t)), t ∈ I. If T+ is finite then ‖u(t)‖M →∞ as t→ T+, and if T− is finite then ‖u(t)‖M → ∞ as t→ T−. Taylor’s formula: Theorem 2. If f ∈ C(Br(0)), then for all x ∈ Br(0) we have
منابع مشابه
BOOTSTRAPPING ROBUST REGRESSION Galen
M-estim::ztes The bootstrap principle is justified for robust M-estimates in regression. (A short proof justifying bootstrapping the empirical process is also given.) l.a.
متن کاملQuantitative uniqueness estimates for the general second order elliptic equations
In this paper we study quantitative uniqueness estimates of solutions to general second order elliptic equations with magnetic and electric potentials. We derive lower bounds of decay rate at infinity for any nontrivial solution under some general assumptions. The lower bounds depend on asymptotic behaviors of magnetic and electric potentials. The proof is carried out by the Carleman method and...
متن کاملVault: Fast Bootstrapping for Cryptocurrencies
Decentralized cryptocurrencies rely on participants to keep track of the state of the system in order to verify new transactions. As the number of users and transactions grows, this requirement places a significant burden on the users, as they need to download, verify, and store a large amount of data in order to participate. Vault is a new cryptocurrency designed to minimize these storage and ...
متن کاملAutomation for Dependent Type Theory
Hammers provide most powerful general purpose automation for proof assistants based on HOL and set theory today. Despite the gaining popularity of the more advanced versions of type theory, such as those based on the Calculus of Inductive Constructions, the construction of hammers for such foundations has been hindered so far by the lack of translation and reconstruction components. In this pap...
متن کاملBootstrapping Morphological Analysis of Gı̃kũyũ Using Unsupervised Maximum Entropy Learning
This paper describes a proof-of-the-principle experiment in which maximum entropy learning is used for the automatic induction of shallow morphological features for the resourcescarce Bantu language of Gı̃kũyũ. This novel approach circumvents the limitations of typical unsupervised morphological induction methods that employ minimum-edit distance metrics to establish morphological similarity bet...
متن کاملBootstrapping the Grenander estimator
Abstract: The goal of this paper is to study the bootstrap for the Grenander estimator. The first result is a proof of the inconsistency of the nonparametric bootstrap for the Grenander estimator at a given point. The second result is the development and verification of a bootstrap for the L1 confidence band for the Grenander estimator. As part of this work, kernel estimators are studied as alt...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015